Optimality criteria for sum of fractional multiobjective optimization problem with generalized invexity
نویسندگان
چکیده
The sum of a fractional program is a nonconvex optimization problem in the field of fractional programming and it is difficult to solve. The development of research is restricted to single objective sums of fractional problems only. The branch and bound methods/algorithms are developed in the literature for this problem as a single objective problem. The theoretical and algorithmic development for sums of fractional programming problems is restricted to single objective problems. In this paper, some new optimality conditions are proposed for the sum of a fractional multiobjective optimization problem with generalized invexity. The optimality conditions are obtained by using a modified objective approach and equivalency with the original problem is established.
منابع مشابه
Nonsmooth Multiobjective Fractional Programming with Generalized Invexity
In this paper, we consider nonsmooth multiobjective fractional programming problems involving locally Lipschitz functions. We introduce the property of generalized invexity for fractional function. We present necessary optimality conditions, sufficient optimality conditions and duality relations for nonsmooth multiobjective fractional programming problems, which is for a weakly efficient soluti...
متن کاملOptimality and duality for nonsmooth multiobjective fractional programming with mixed constraints
We consider nonsmooth multiobjective fractional programming problems with inequality and equality constraints. We establish the necessary and sufficient optimality conditions under various generalized invexity assumptions. In addition, we formulate a mixed dual problem corresponding to primal problem, and discuss weak, strong and strict converse duality theorems.
متن کاملSufficiency and duality for a nonsmooth vector optimization problem with generalized $alpha$-$d_{I}$-type-I univexity over cones
In this paper, using Clarke’s generalized directional derivative and dI-invexity we introduce new concepts of nonsmooth K-α-dI-invex and generalized type I univex functions over cones for a nonsmooth vector optimization problem with cone constraints. We obtain some sufficient optimality conditions and Mond-Weir type duality results under the foresaid generalized invexity and type I cone-univexi...
متن کاملOn efficiency and mixed duality for a new class of nonconvex multiobjective variational control problems
In this paper, we extend the notions of ( , ρ)-invexity and generalized ( , ρ)invexity to the continuous case and we use these concepts to establish sufficient optimality conditions for the considered class of nonconvexmultiobjective variational control problems. Further, multiobjective variational control mixed dual problem is given for the considered multiobjective variational control problem...
متن کاملNonsmooth Continuous-Time Multiobjective Optimization Problems with Invexity
A few Karush-Kuhn-Tucker type of sufficient optimality conditions are given in this paper for nonsmooth continuous-time nonlinear multi-objective optimization problems in the Banach space L∞ [0, T ] of all n-dimensional vector-valued Lebesgue measurable functions which are essentially bounded, using Clarke regularity and generalized convexity. Further, we establish duality theorems for Wolfe an...
متن کامل